Enhancing Kernel Maximum Margin Projection for Face Recognition
نویسندگان
چکیده
To efficiently deal with the face recognition problem, a novel face recognition algorithm based on enhancing kernel maximum margin projection(MMP) is proposed in this paper. The main contributions of this work are as follows. First, the nonlinear extension of MMP through kernel trick is adopted to capture the nonlinear structure of face images. Second, the kernel deformation technique is proposed to increase the discriminating capability of original input kernel function. Third, the feature vector selection approach is applied to improve computational efficiency of kernel MMP. Finally, the multiplicative update rule is employed to enhance training speed of SVM classifier for face recognition. Experimental results on face recognition demonstrate the effectiveness and efficiency of the proposed algorithm.
منابع مشابه
Two-dimensional Maximum Margin Projection for Face Recognition
To effectively cope with the high dimensionality problem in face recognition, a novel two-dimensional maximum margin projection (2DMMP) algorithm for face recognition is proposed in this paper. Specially, 2DMMP is based on the maximum margin projection (MMP) and fully considers the intrinsic tensor structure of face image. By utilizing both local manifold structure and discriminative informatio...
متن کاملOrthogonal Maximum Margin Projection for Face Recognition
Dimensionality reduction techniques that can introduce low-dimensional feature representation with enhanced discriminatory power are of paramount importance in face recognition. In this paper, a novel subspace learning algorithm called orthogonal maximum margin projection(OMMP) is proposed. The OMMP algorithm is based on the maximum margin projection (MMP), which aims at discovering both geomet...
متن کاملMulti-dimensional subspace based feature selection for face recognition
In this project, we propose a novel kernel named Adaptive Data-dependent Matrix Norm Based Gaussian Kernel (ADM-Gaussian kernel) for facial feature extraction. As a popular facial feature extraction method for face recognition, the current kernel method endures some problems. Firstly, the face image must be transformed to the vector, which leads to the large storage requirements and the large c...
متن کاملGini Support Vector Machine: Quadratic Entropy Based Robust Multi-Class Probability Regression
Many classification tasks require estimation of output class probabilities for use as confidence scores or for inference integrated with other models. Probability estimates derived from large margin classifiers such as support vector machines (SVMs) are often unreliable. We extend SVM large margin classification to GiniSVM maximum entropy multi-class probability regression. GiniSVM combines a q...
متن کاملAdaptive Quasiconformal Kernel Fisher Discriminant Analysis via Weighted Maximum Margin Criterion
Kernel Fisher discriminant analysis (KFD) is an effective method to extract nonlinear discriminant features of input data using the kernel trick. However, conventional KFD algorithms endure the kernel selection problem as well as the singular problem. In order to overcome these limitations, a novel nonlinear feature extraction method called adaptive quasiconformal kernel Fisher discriminant ana...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- JSW
دوره 8 شماره
صفحات -
تاریخ انتشار 2013